|
DCFS, the International Workshop on Descriptional Complexity of Formal Systems is an annual academic conference in the field of computer science. Beginning with the 2011 edition, the proceedings of the workshop appear in the series Lecture Notes in Computer Science. Already since the very beginning, extended versions of selected papers are published as special issues of the International Journal of Foundations of Computer Science, the Journal of Automata, Languages and Combinatorics, and of Theoretical Computer Science. In 2002 DCFS was the result of the merger of the workshops DCAGRS (Descriptional Complexity of Automata, Grammars and Related Structures) and FDSR (Formal Descriptions and Software Reliability). The workshop is often collocated with international conferences in related fields, such as ICALP, DLT and CIAA. == Topics of the workshop == Typical topics include: * various measures of descriptional complexity of automata, grammars, languages and of related systems * trade-offs between descriptional complexity and mode of operation * circuit complexity of Boolean functions and related measures * succinctness of description of (finite) objects * descriptional complexity in resource-bounded or structure-bounded environments * structural complexity * descriptional complexity of formal systems for applications (e.g. software reliability, software and hardware testing, modelling of natural languages) * descriptional complexity aspects of nature-motivated (bio-inspired) architectures and unconventional models of computing * Kolmogorov–Chaitin complexity and descriptional complexity As such, the topics of the conference overlap with those of the International Federation for Information Processing Working Group 1.2 on descriptional complexity. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Descriptional Complexity of Formal Systems」の詳細全文を読む スポンサード リンク
|